Fault Localization for Java Programs using Probabilistic Program Dependence Graph

نویسندگان

  • A. Askarunisa
  • T. Manju
  • B. Giri Babu
چکیده

Fault localization is a process to find the location of faults. It determines the root cause of the failure. It identifies the causes of abnormal behaviour of a faulty program. It identifies exactly where the bugs are. Existing fault localization techniques are Slice based technique, ProgramSpectrum based Technique, Statistics Based Technique, Program State Based Technique, Machine learning based Technique and Similarity Based Technique. In the proposed method Model Based Fault Localization Technique is used, which is called Probabilistic Program Dependence Graph . Probabilistic Program Dependence Graph (PPDG) is an innovative model that scans the internal behaviour of the project. PPDG construction is enhanced by Program Dependence Graph (PDG). PDG is achieved by the Control Flow Graph (CFG). The PPDG construction augments the structural dependences represented by a program dependence graph with estimates of statistical dependences between node states, which are computed from the test set. The PPDG is based on the established framework of probabilistic graphical models. This work presents algorithms for constructing PPDGs and applying fault localization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The Bayesian Network based program dependence graph and its application to fault localization

Fault localization is an important and expensive task in software debugging. Some probabilistic graphical models such as probabilistic program dependence graph (PPDG) have been used in fault localization. However, PPDG is insufficient to reason across nonadjacent nodes and only support making inference about local anomaly. In this paper, we propose a novel probabilistic graphical model called B...

متن کامل

Probabilistic Noninterference Based on Program Dependence Graphs

We present a new algorithm for checking probabilistic noninterference in concurrent programs. The algorithm uses the Low-Security Observational Determinism criterion. It is based on program dependence graphs for concurrent programs, and is thus very precise: it is flowsensitive, context-sensitive, object-sensitive, and optionally time-sensitive. The algorithm has been implemented for full Java ...

متن کامل

Multithreaded Dependence Graphs for Concurrent Java Programs

Understanding program dependencies in a computer program is essential for many software engineering activities including program slicing, testing, debugging, reverse engineering, and maintenance. In this paper, we present a dependence-based representation called multithreaded dependence graph, which extends previous dependence-based representations, to represent program dependencies in a concur...

متن کامل

An Approach to Fault Modeling and Fault Seeding Using the Program Dependence Graph1

We present a fault-classification scheme and a fault-seeding method that are based on the manifestation of faults in the program dependence graph (PDG). We enhance the domain/computation faultclassification scheme developed by Howden to further characterize faults as structural and statement-level, depending on the differences between the PDG for the original program and the PDG for the faulty ...

متن کامل

Dependence Analysis for Recursive Java Programs_SIGPlan_...

Dependence analysis is an important approach to analyzing, understanding, testing and maintaining programs. T his paper develops a new kind of dependence analysis method for recursive Java programs. In our method, the program dependence graph (PDG) of a Java program consists of a set of PDGs that are not connected. They interact with each other by dependences among parameters. Thus, t he inter-...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1201.3985  شماره 

صفحات  -

تاریخ انتشار 2011